T-DominO
نویسندگان
چکیده
Abstract Real-world design problems are a messy combination of constraints, objectives, and features. Exploring these problem spaces can be defined as Multi-Criteria Exploration (MCX) problem, whose goals to produce set diverse solutions with high performance across many while avoiding low any objectives. Quality-Diversity algorithms the needed variation, but typically consider only single objective. We present new ranking, T-DominO, specifically designed handle multiple objectives in MCX problems. T-DominO ranks individuals relative other archive, favoring balanced over those which excel at few cost others. Keeping solution each MAP-Elites bin maintains visual accessibility archive – strong asset for exploration. illustrate our approach on easily understood benchmarks, showcase its potential many-objective real-world architecture case study.
منابع مشابه
Domino Treewidth
We consider a special variant of tree-decompositions, called domino treedecompositions, and the related notion of domino treewidth. In a domino tree-decomposition, each vertex of the graph belongs to at most two nodes of the tree. We prove that for every k, d, there exists a constant ck;d such that a graph with treewidth at most k and maximum degree at most d has domino treewidth at most ck;d. ...
متن کاملCounting domino trains
In this paper we present a way to count the number of trains that we can construct with a given set of domino pieces. As an application we obtain a new method to compute the total number of eulerian paths in an undirected graph as well as their starting and ending vertices. Resumen. En este art́ıculo presentamos una manera de contar el número de trenes que se puede construir con un determinado c...
متن کاملFast Domino Tileability
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston’s height function approach to a nearly linear time in the perimeter.
متن کاملDomino Fibonacci Tableaux
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the “color-to-spin” property, that is, the property that the total color of the permutation equals the sum of the spins of the domino tableaux. In this paper, we describe the poset of domino Fibonacci shapes, an isomorphic equivalent to Stanley’s Fibonacci lattice...
متن کاملGeneralized domino-shuffling
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph An, or more generally calculating the sum of the weights of all the matchings, where the weight of a matching is equal to the product of the (pre-assigned) weights of the constituent edges. This article presents eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-14721-0_19